Ten Reasons to Use Divisible Load Theory

نویسنده

  • Thomas G. Robertazzi
چکیده

Thomas G. Robertazzi State University of New York, Stony Brook T he increasing prevalence of multiprocessor systems and data-intensive computing has created a need for efficient scheduling of computing loads, especially parallel loads that are divisible among processors and links. During the past decade, divisible load theory has emerged as a powerful tool for modeling data-intensive computational problems. DLT originated from a desire to create intelligent sensor networks, but most recent applications involve parallel and distributed computing. The first published research on divisible load theory appeared in a 1988 doctoral dissertation by James Cheng— now director of venture technology at the Siemens Technology-to-Business Center in Berkeley, California—at the State University of New York, Stony Brook. Cheng originally sought to develop intelligent sensor networks that could make measurements, compute, and communicate, but his thesis committee regarded his early work as too theoretical and required more application-related material before giving their approval. Cheng’s original 1988 paper contains an intuitive proof of the DLT optimality principle, but a formal proof did not appear until five years later, following extensive search runs on an IBM mainframe in 1989. The theory’s linearity also gradually became apparent in the early 1990s. Since then, an international group of researchers from several countries has participated in a cooperative effort to develop DLT, generating more than 50 journal papers and two books (www.ece.sunysb.edu). Like other linear mathematical models such as Markovian queuing theory and electric resistive circuit theory, DLT offers easy computation, a schematic language, and equivalent network element modeling. Because DLT does not recognize precedence relations among data, it assumes that computation and communication loads can be partitioned arbitrarily among numerous processors and links, respectively. While it can incorporate stochastic features, the basic model does not make statistical assumptions, which can be the Achilles’ heel of a performance evaluation model.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Divisible Load Scheduling for Grid Computing

The use of divisible load scheduling theory is proposed to model and design grid systems such as those arising in large physics experiments. Current divisible load theory is summarized. A typical application, the STAR experiment at RHIC is discussed. This includes a sample calculation based on existing infrastructure numbers.

متن کامل

Multi-Criteria Based Algorithm for Scheduling Divisible Load

Divisible load theory has become a popular area of research during the past two decades. Based on divisible load theory the computations and communications can be divided into some arbitrarily independent parts and each part can be processed independently by a processor. Existing divisible load scheduling algorithms do not consider any priority for allocating fraction of load. In some situation...

متن کامل

Energy Considerations for Divisible Load Processing

In this paper we analyze energy usage in divisible load processing. Divisible load theory (DLT) applies to computations which can be divided into parts of arbitrary sizes, and the parts can be independently processed in parallel. The shortest schedule for divisible load processing is determined by the speed of computation and communication. Energy usage for such a time-optimum schedule is analy...

متن کامل

Modeling for Integration of Divisible Load Theory and Markov Chains

In this paper the equivalence between various divisible load-scheduling policies and continuous time Markov chains is demonstrated. The problem is to show optimal divisible load schedules for various network topologies have Markov chain analogs. This paper is a continuation of our initial short paper [1] that introduced this unification between divisible load theory and Markov chain models for ...

متن کامل

Dominance properties for Divisible MapReduce Computations

In this paper we analyze MapReduce distributed computations as divisible load scheduling problem. The two operations of mapping and reducing can be understood as two divisible applications with precedence constraints. A divisible load model is proposed, and schedule dominance properties are analyzed. We investigate dominant schedule structures for MapReduce computations. To our best knowledge t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEEE Computer

دوره 36  شماره 

صفحات  -

تاریخ انتشار 2003